A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries
نویسنده
چکیده
We present a 2 ~ O(p n) time exact learning algorithm for polynomial size DNF using equivalence queries only. In particular, DNF is PAC-learnable in subexponential time under any distribution. This is the rst subexponential time PAC-learning algorithm for DNF under any distribution.
منابع مشابه
Tight Bounds on Proper Equivalence Query Learning of DNF
We prove a new structural lemma for partial Boolean functions f , which we call the seed lemma for DNF. Using the lemma, we give the first subexponential algorithm for proper learning of poly(n)-term DNF in Angluin’s Equivalence Query (EQ) model. The algorithm has time and query complexity 2 √ , which is optimal. We also give a new result on certificates for DNF-size, a simple algorithm for pro...
متن کاملOracles and Queries That Are Sufficient for Exact Learning
We show that the class of all circuits is exactly learnable in randomized expected polynomial time using subset and superset queries. This is a consequence of the following result which we consider to be of independent interest: circuits are exactly learnable in randomized expected polynomial time with equivalence queries and the aid of an NP-oracle. We also show that circuits are exactly learn...
متن کاملLearning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries
We present results concerning the learning of Monotone DNF (MDNF) from Incomplete Membership Queries and Equivalence Queries. Our main result is a new algorithm that allows efficient learning of MDNF using Equivalence Queries and Incomplete Membership Queries with probability of p = 1 − 1/poly(n, t) of failing. Our algorithm is expected to make
متن کاملExact Learning Boolean Function via the Monotone Theory
We study the learnability of boolean functions from membership and equivalence queries. We develop the Monotone Theory that proves 1) Any boolean function is learnable in polynomial time in its minimal DNF size, its minimal CNF size and the number of variables n. In particular, 2) Decision trees are learnable. Our algorithms are in the model of exact learning with membership queries and unrestr...
متن کاملOn Learning Branching Programs and Small Depth Circuits
This paper studies the learnability of branching programs and small depth circuits with modular and threshold gates in both the exact and PAC learning models with and without membership queries. Some of the results extend earlier works in GG95, ERR95, BTW95]. The main results are as follows. For branching programs we show the following. 1. Any monotone width two branching program (deened by Bor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 59 شماره
صفحات -
تاریخ انتشار 1995